Efficient Schemes for Monte Carlo Markov Chain Algorithms in Global Illumination
نویسندگان
چکیده
Current MCMC algorithms are limited from achieving high rendering efficiency due to possibly high failure rates in caustics perturbations and stratified exploration of the image plane. In this paper we improve the MCMC approach significantly by introducing new lens perturbation and new path-generation methods. The new lens perturbation method simplifies the computation and control of caustics perturbation and can increase the perturbation success rate. The new path-generation methods aim to concentrate more computation on “high perceptual variance” regions and “hard-to-find-but-important” paths. We implement these schemes in the Population Monte Carlo Energy Redistribution framework to demonstrate the effectiveness of these improvements. In addition., we discuss how to add these new schemes into the Energy Redistribution Path Tracing and Metropolis Light Transport algorithms. Our results show that rendering efficiency is improved with these new schemes.
منابع مشابه
Particle Markov Chain Monte Carlo for Multiple Change-point Problems
Multiple change-point models are a popular class of time series models which allow the description of temporal heterogeneity in data. We develop efficient Markov Chain Monte Carlo (MCMC) algorithms to perform Bayesian inference in this context. Our so-called Particle MCMC (PMCMC) algorithms rely on an efficient Sequential Monte Carlo (SMC) technique for change-point models, developed in [13], t...
متن کاملA Survey on Recent Developments in Global Illumination Techniques
The paper presents recent developments in global illumination techniques for producing photo-realistic images. In pursuit of the increasing requirement for photo-realism in various industries, research and development into global illumination techniques has received considerable attention within the graphics community from the early days. In this survey, we review various global illum...
متن کاملQuasi-Monte Carlo Methods in Computer Graphics, Part II: The Radiance Equation
The radiance equation, which describes the global illumination problem in computer graphics, is a high dimensional integral equation. Estimates of the solution are usually computed on the basis of Monte Carlo methods. In this paper we propose and investigate quasi-Monte Carlo methods, which means that we replace (pseudo-) random samples by low discrepancy sequences, yielding deterministic algor...
متن کاملParticle Markov chain Monte Carlo methods
Markov chain Monte Carlo and sequential Monte Carlo methods have emerged as the two main tools to sample from high dimensional probability distributions.Although asymptotic convergence of Markov chain Monte Carlo algorithms is ensured under weak assumptions, the performance of these algorithms is unreliable when the proposal distributions that are used to explore the space are poorly chosen and...
متن کامل